On Symbolic-Numeric Solving of Sine-Polynomial Equations
نویسندگان
چکیده
منابع مشابه
On Symbolic-Numeric Solving of Sine-Polynomial Equations
This paper deals with the localization of all the real roots of sine-polynomials. D. Richardson (1991, in ``effective Methods in Algebraic Geometry,'' pp. 427 440, Birkha user, Basel) has already studied this type of analytic function. He showed how to find the number of real roots in a bounded interval. Here we propose an algorithm which determines whether a sine-polynomial has a finite number...
متن کاملSymbolic-numeric methods for solving polynomial equations and applications
This tutorial gives an introductive presentation of algebraic and geometric methods for solving a polynomial system f1 = · · · = fm = 0. The first class of methods is based on the study of the quotient algebra A of the polynomial ring modulo the ideal I = (f1, . . . , fm). We show how to deduce the geometry of the solutions, from the structure of A and in particular, how solving polynomial equa...
متن کاملSolving Nonlinear Polynomial Systems via Symbolic-Numeric Elimination Method
Consider a general polynomial system S in x1, . . . , xn of degree q and its corresponding vector of monomials of degree less than or equal to q. The system can be written as M0 · [xq1, xq−1 1 x2, . . . , xn, x1, . . . , xn, 1] = [0, 0, . . . , 0, 0, . . . , 0, 0] (1) in terms of its coefficient matrix M0. Here and hereafter, [...] T means the transposition. Further, [ξ1, ξ2, . . . , ξn] is one...
متن کاملSolving Parametric Polynomial Equations and Inequalities by Symbolic Algorithms
The talk gives a survey on some symbolic algorithmic methods for solving systems of algebraic equations with special emphasis on parametric systems. Besides complex solutions I consider also real solutions of systems including inequalities. The techniques described include the Euclidean algorithm, Grr obner bases, characteristic sets, univariate and multivariate Sturm-Sylvester theorems, compre...
متن کاملNumeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
We consider a family of polynomial systems which arises in the analysis of the stationary solutions of a standard discretization of certain semilinear second order parabolic partial differential equations. We prove that this family is well–conditioned from the numeric point of view, and ill–conditioned from the symbolic point of view. We exhibit a polynomial–time numeric algorithm solving any m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2000
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0534